A New Facet Generating Procedure for the Stable Set Polytope
نویسندگان
چکیده
We introduce a new facet-generating procedure for the stable set polytope, based on replacing (k− 1)-cliques with certain k-partite graphs, which subsumes previous procedures based on replacing vertices with stars, and thus also many others in the literature. It can be used to generate new classes of facet-defining inequalities.
منابع مشابه
Facet Generating Techniques
Given a polyhedron P which is of interest, a major goal of polyhedral combinatorics is to find classes of essential, i.e. facet inducing inequalities which describe P . In general this is a difficult task. We consider the case in which we have knowledge of facets for a face F of P , and present some general theory and methods for exploiting the close relationship between such polyhedra in order...
متن کاملThe stable set polytope of ($P_6$, triangle)-free graphs and new facet-inducing graphs
The stable set polytope of a graph G, denoted as STAB(G), is the convex hull of all the incidence vectors of stable sets of G. To describe a linear system which defines STAB(G) seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (P6,triangle)-free graphs (and more generally of (P6,paw)-free graphs). For that we combine ...
متن کاملGeneral Cut-Generating Procedures for the Stable Set Polytope
We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Campêlo. In contrast to existing cut-generating procedures, ours generate both rank and non-rank valid inequalities, hence they are of a more general nature than existing methods. This is accomplished by iteratively s...
متن کاملFacets with fixed defect of the stable set polytope
The stable set polytope of a graph is the convex hull of the 01 vectors corresponding to stable sets of vertices. To any nontrivial facet ∑n i=1 aixi ≤ b of this polytope we associate an integer δ, called the defect of the facet, by δ = ∑n i=1 ai − 2b. We show that for any fixed δ there is a finite collection of graphs (called “basis”) such that any graph with a facet of defect δ contains a sub...
متن کاملColoring planar Toeplitz graphs and the stable set polytope
Cliques and odd cycles are well known to induce facet-de.ning inequalities for the stable set polytope. In graph coloring cliques are a class of n-critical graphs whereas odd cycles represent the class of 3-critical graphs. In the .rst part of this paper we generalize both notions to (Kn \ e)-cycles, a new class of n-critical graphs, and discuss some implications for the class of in.nite planar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 37 شماره
صفحات -
تاریخ انتشار 2011